Tournaments for Selecting the Best Under Adversarial Errors

نویسندگان

  • Alina Beygelzimer
  • John Langford
  • Pradeep Ravikumar
چکیده

We present a family of adaptive pairwise tournaments which are provably robust against large error fractions when used to determine the largest element in a set. These tournaments use nk pairwise comparisons but have only O(k + log n) depth where n is the number of players and k is a robustness parameter (for reasonable values of n and k). We show how these tournaments can be used to prove multiclass-to-binary reductions in machine learning with the tightest ever analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three prominent tournament formats: predictive power and costs∗

We analyze tournaments of heterogeneous players from an organizer’s perspective. Using a simple model of a noisy tournament, we demonstrate how the likelihood of selecting the best player, here termed the “predictive power” of a tournament, depends on the tournament format, the distribution of players’ types, and the overall noise level. We formalize the organizer’s decision problem for varying...

متن کامل

Robust Bounds on Choosing from Large Tournaments

Tournament solutions provide methods for selecting the best alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out any alternative in large random tournaments. Nevertheless, all analytical results thus far have assumed a rigid probabilistic model, in which either a tournament...

متن کامل

Selecting the Best? Spillover and Shadows in Elimination Tournaments

We consider how past, current, and future competition within an elimination tournament a§ect the probability that the stronger player wins. We present a two-stage model that yields the following main results: (1) a shadow e§ectóthe stronger the expected future competitor, the lower the probability that the stronger player wins in the current stage and (2) an e§ort spillover e§ectóprevious e§ort...

متن کامل

Coloring tournaments with forbidden substructures

Coloring graphs is an important algorithmic problem in combinatorics with many applications in computer science. In this paper we study coloring tournaments. A chromatic number of a random tournament is of order Ω( n log(n)). The question arises whether the chromatic number can be proven to be smaller for more structured nontrivial classes of tournaments. We analyze the class of tournaments def...

متن کامل

Preemptive Behavior in Sequential-Move Tournaments with Heterogeneous Agents

Rank-order tournaments are usually modeled simultaneously. However, real tournaments are often sequential. We show that agents’ strategic behavior in sequential-move tournaments significantly differ from the one in simultaneous-move tournaments: In a sequential-move tournament with heterogeneous agents, there may be either a first-mover or a second-mover advantage. Under certain conditions the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007